Description: 一篇用VHDL实现快速傅立叶变换的论文，包括原理分析和代码实现，印度圣雄甘地大学M.A.学院提供，同时包含使用手册，做FFT很好的-VHDL with a fast Fourier transform papers, including the principle of analysis and code, India Mahatma Gandhi Institute of the University of MA, at the same time contains the user manual, so good FFT Platform: |
Size: 391168 |
Author:费尔德 |
Hits:
Description: 数字控制振荡器（NCO，numerical controlled oscillator）是软件无线电、直接数据频
率合成器（DDS，Direct digital synthesizer）、快速傅立叶变换（FFT，Fast Fourier Transform）
等的重要组成部分，同时也是决定其性能的主要因素之一，随着芯片集成度的提高、在信号
处理、数字通信领域、调制解调、变频调速、制导控制、电力电子等方面得到越来越广泛的
应用。-Digital controlled oscillator (NCO, numerical controlled oscillator) is a software-defined radio, direct data on the frequency synthesizer (DDS, Direct digital synthesizer), Fast Fourier Transform (FFT, Fast Fourier Transform), such as an important component of the decision at the same time the performance of one of the main factors, along with the improvement of the chip integrated in the signal processing, digital communications, modulation and demodulation, frequency conversion speed control, guidance control, such as power electronics get more and more widely. Platform: |
Size: 4096 |
Author:司令 |
Hits:
Description: 基于VHDL语言的一个FFT快速傅里叶变换程序。采用4蝶形算法-VHDL language based on a FFT Fast Fourier Transform procedure. 4 butterfly algorithm used Platform: |
Size: 180224 |
Author:李超 |
Hits:
Description: 计算离散傅里叶变换的一种快速算法,简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少,特别是被变换的抽样点数N越多,FFT算法计算量的节省就越显著。
-Discrete Fourier transform calculation of a fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by JW Cooley and TW map out Kormakiti. This algorithm enables calculation of discrete Fourier transform computer required a significant reduction in the number of multiplication, in particular by changing the sampling points N more, FFT algorithm for calculating the amount of savings will be significant. Platform: |
Size: 1024 |
Author:圈石 |
Hits:
Description: CFFT is a radix-4 fast Fourier transform (FFT) core with configurable data width and
a configurable number of sample points in the FFT.
Twiddle factors are implemented using the CORDIC algorithm, causing the gain of the
CFFT core to be different from the standard FFT algorithm. This variation in gain
is not important for orthogonal frequency division modulation (OFDM) and demodulation.
The gain can be corrected, to that of a conventional FFT, by applying a constant
multiplying factor.
Platform: |
Size: 183296 |
Author:Nagendran |
Hits:
Description: Implementing the Radix-4 Decimation
in Frequency (DIF) Fast Fourier
Transform (FFT) Algorithm Using a
TMS320C80 DSP Platform: |
Size: 150528 |
Author:seojinwon |
Hits:
Description: VHDL编写的FPGA中实现快速傅里叶变换，程序完成，适合入门后进行练手用。-Written in the FPGA VHDL fast Fourier transform process is completed, after the training for entry-hand. Platform: |
Size: 611328 |
Author: |
Hits:
Description: The Fast Fourier Transform (FFT) is one of the
rudimentary operations in field of digital signal and image
processing. Some of the very vital applications of the fast
fourier transform include Signal analysis, Sound filtering, Data
compression, Partial differential equations, Multiplication of
large integers, Image filtering etc.Fast Fourier transform
(FFT) is an efficient implementation of the discrete Fourier
transform (DFT). This paper concentrates on the development
of the Fast Fourier Transform (FFT), based on Decimation-In-
Time (DIT) domain, Radix-2 algorithm, this paper uses VHDL
as a design entity, and their Synthesis by Xilinx Synthesis Tool
on Vertex kit has been done. The input of Fast Fourier
transform has been given by a PS2 KEYBOARD using a
testbench and output has been displayed using the waveforms
on the Xilinx Design Suite 12.1.The synthesis results show that
the computation for calculating the 32-point Fast Fourier
transform is efficient in terms of speed. Platform: |
Size: 305152 |
Author:doggaravi |
Hits:
Search - Fast Fourier Transform in vhdl